Compound group extensions. I. Continuations of normal homomorphisms
نویسندگان
چکیده
منابع مشابه
Extensions of ELECTRE-I and TOPSIS methods for group decision-making under complex Pythagorean fuzzy environment
Multi-criteria group decision-making is a process in which decision makers assess the performance of alternatives on the basis of conflicting criteria to opt the most worthy alternative as solution. TOPSIS and ELECTRE are effective and commonly used methods to solve multiple criteria decision-making problems. The aim of this study is to propose two new models, namely, complex Pythagorean fuzzy ...
متن کاملLattice Homomorphisms Induced by Group Homomorphisms
Introduction. By a lattice homorphism of a group G onto a group G' we mean a single-valued mapping of the lattice L(G) of subgroups of G onto the lattice L(G') of subgroups of G', which preserves all unions and intersections, that is, which is subject to the conditions 1. (U,S,)0 = U,(S¿), 2. (r\vSr) = Ç)ASd>), for every (finite or infinite) set of subgroups 5„ of G. We call proper any l...
متن کاملQuasidiagonal Extensions and Sequentially Trivial Asymptotic Homomorphisms
to be quasidiagonal when B⊗K contains an approximate unit of projections which is quasi-central in E, cf. [Sa]. He identified, under certain conditions, the subgroup of KK(A,B) which the quasidiagonal extensions correspond to under Kasparov’s isomorphism Ext(A,B) ' KK(A,B). C. Schochet has removed some of Salinas’ conditions in [S], the result being that when A is a unital C-algebra in the boot...
متن کاملComputing with Group Homomorphisms
Let G = (X) and H be finite groups and let r : X ~ H be a map from the generating set X of G into H. We describe a simple approach for deciding whether or not r determines a group homomorphism from G to H, and if it does, for computing the kernel of r If O and H are permutation groups the algorithm is a simple application of standard algorithms for bases and strong generating sets. If G and H a...
متن کاملHomomorphisms of conjunctive normal forms
We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If φ : H → F is a homomorphism, then unsatisfiability of H implies unsatisfiability of F . Homomorphisms from F to a subset F ′ of F (endomorphisms) are of special interest, since in such case F and F ′ are satisfiability-equivalent. We show that smallest subsets F ′ of a formula F for w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1953
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1953-0059911-7